A Proximal Point Algorithm Revisited and Extended

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proximal Point Methods Revisited

The proximal point methods have been widely used in the last decades to approximate the solutions of nonlinear equations associated with monotone operators. Inspired by the iterative procedure defined by B. Martinet (1970), R.T. Rockafellar introduced in 1976 the so-called proximal point algorithm (PPA) for a general maximal monotone operator. The sequence generated by this iterative method is ...

متن کامل

The proximal point method revisited∗

In this short survey, I revisit the role of the proximal point method in large scale optimization. I focus on three recent examples: a proximally guided subgradient method for weakly convex stochastic approximation, the prox-linear algorithm for minimizing compositions of convex functions and smooth maps, and Catalyst generic acceleration for regularized Empirical Risk Minimization.

متن کامل

A Hybrid Projection – Proximal Point Algorithm ∗

We propose a modification of the classical proximal point algorithm for finding zeroes of a maximal monotone operator in a Hilbert space. In particular, an approximate proximal point iteration is used to construct a hyperplane which strictly separates the current iterate from the solution set of the problem. This step is then followed by a projection of the current iterate onto the separating h...

متن کامل

A Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces

Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...

متن کامل

A Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators

In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Optimization Theory and Applications

سال: 2019

ISSN: 0022-3239,1573-2878

DOI: 10.1007/s10957-019-01536-5